An Alternating Direction Approximate Newton Algorithm for Ill-Conditioned Inverse Problems with Application to Parallel MRI

نویسندگان

  • William Hager
  • Cuong Ngo
  • Maryam Yashtini
  • Hong-Chao Zhang
چکیده

Analternating direction approximateNewton (ADAN)method is developed for solving inverse problems of the form min{φ(Bu)+ (1/2)‖Au− f ‖2}, where φ is convex and possibly nonsmooth, and A and B are matrices. Problems of this form arise in image reconstruction where A is the matrix describing the imaging device, f is the measured data, φ is a regularization term, and B is a derivative operator. The proposed algorithm is designed to handle applications where A is a large dense, ill-conditioned matrix. The algorithm is based on the alternating direction method of multipliers (ADMM) and an approximation to Newton’s method in which a term in Newton’s This research was partly supported by National Science Foundation (Nos. 1115568 and 1016204) and by Office of Naval Research Grants (Nos. N00014-11-1-0068 and N00014-15-1-2048). B Hong-Chao Zhang [email protected] https://www.math.lsu.edu/∼hozhang/ William Hager [email protected] http://people.clas.ufl.edu/hager/ Cuong Ngo [email protected] http://people.clas.ufl.edu/ngocuong/ Maryam Yashtini [email protected] http://people.math.gatech.edu/∼myashtini3/ 1 Department of Mathematics, University of Florida, PO Box 118105, Gainesville, FL 32611-8105, USA 2 School of Mathematics, Georgia Institute of Technology, 686 Cherry Street, Atlanta, GA 30332-0160, USA 3 Department of Mathematics, Louisiana State University, Baton Rouge, LA 70803-4918, USA

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A numerical Algorithm Based on Chebyshev Polynomials for Solving some Inverse Source Problems

In this paper‎, two inverse problems of determining an unknown source term in a parabolic‎ equation are considered‎. ‎First‎, ‎the unknown source term is ‎estimated in the form of a combination of Chebyshev functions‎. ‎Then‎, ‎a numerical algorithm based on Chebyshev polynomials is presented for obtaining the solution of the problem‎. ‎For solving the problem‎, ‎the operational matrices of int...

متن کامل

A Statistical Method for Regularizing Nonlinear Inverse Problems

Inverse problems are typically ill-posed or ill-conditioned and require regularization. Tikhonov regularization is a popular approach and it requires an additional parameter called the regularization parameter that has to be estimated. The χ method introduced by Mead in [8] uses the χ distribution of the Tikhonov functional for linear inverse problems to estimate the regularization parameter. H...

متن کامل

Error bounds for extremely ill-conditioned problems

We discuss methods to compute error bounds for extremely ill-conditioned problems. As a model problem we treat matrix inversion. We demonstrate that additive corrections to improve an approximate inverse are useful for ill-conditioned problems, but hardly usable for extremely ill-conditioned problems. Here multiplicative corrections can be used, including the possibility to compute guaranteed e...

متن کامل

Inversion of Extremely Ill-Conditioned Matrices in Floating-Point

Let an n × n matrix A of floating-point numbers in some format be given. Denote the relative rounding error unit of the given format by eps. Assume A to be extremely ill-conditioned, that is cond(A) eps−1. In about 1984 I developed an algorithm to calculate an approximate inverse of A solely using the given floating-point format. The key is a multiplicative correction rather than a Newton-type ...

متن کامل

Parallel solution of large-scale free surface viscoelastic flows via sparse approximate inverse preconditioning

Though computational techniques for two-dimensional viscoelastic free surface flows are well developed, three-dimensional flows continue to present significant computational challenges. Fully coupled free surface flow models lead to nonlinear systems whose steady states can be found via Newton’s method. Each Newton iteration requires the solution of a large, sparse linear system, for which memo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015